See four color problem in All languages combined, or Wiktionary
{
"forms": [
{
"form": "four color problems",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "four color problem (plural four color problems)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Four",
"orig": "en:Four",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [],
"source": "w"
}
],
"glosses": [
"The problem of coloring a map with no more than four colors, such that no two adjacent regions have the same color."
],
"id": "en-four_color_problem-en-noun-U7kFQmfc",
"links": [
[
"graph theory",
"graph theory"
],
[
"color",
"color"
],
[
"map",
"map"
],
[
"four",
"four"
],
[
"adjacent",
"adjacent"
]
],
"raw_glosses": [
"(graph theory) The problem of coloring a map with no more than four colors, such that no two adjacent regions have the same color."
],
"related": [
{
"word": "four color theorem"
}
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "four color problem"
}
{
"forms": [
{
"form": "four color problems",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "four color problem (plural four color problems)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "four color theorem"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Four",
"en:Graph theory"
],
"glosses": [
"The problem of coloring a map with no more than four colors, such that no two adjacent regions have the same color."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"color",
"color"
],
[
"map",
"map"
],
[
"four",
"four"
],
[
"adjacent",
"adjacent"
]
],
"raw_glosses": [
"(graph theory) The problem of coloring a map with no more than four colors, such that no two adjacent regions have the same color."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "four color problem"
}
Download raw JSONL data for four color problem meaning in English (1.0kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2026-01-16 from the enwiktionary dump dated 2026-01-01 using wiktextract (d1270d2 and 9905b1f). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.